Analysis of Duality Constructions for Variable Dimension Fixed Point Algorithms
نویسندگان
چکیده
Variable dimension algorithms are a class of algorithms for computation of fixed points. They normally start at a single point and generate a path of simplices of varying dimension until a simplex that contains an approximation of a fixed point is found. This thesis analyzes, compares, and contrasts five duality models for variable dimension fixed point algorithms, namely, primal-dual subdivided manifolds, primal-dual pseudomanifolds, V-complexes and H-complexes, the framework K, and antiprisms. Each framework is defined, examples are given, and the relation between them is discussed. Thesis Supervisor: Dr. Robert M. Freund Title: Associate Professor of Operations Research and Management
منابع مشابه
Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملOn new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کاملStrong convergence of modified iterative algorithm for family of asymptotically nonexpansive mappings
In this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regular asymptotically nonexpansive mappings in a real reflexive Banach space with a uniformly G$hat{a}$teaux differentiable norm. Our result is applicable in $L_{p}(ell_{p})$ spaces, $1 < p
متن کاملAn introduction to PL algorithms
We give a brief introduction to piecewise linear (PL) algorithms, also called complementary pivot or fixed point algorithms. Our approach is based on the fundamental presentation of Eaves [14], hence we describe the algorithms in the general setting of PL manifolds. In particular, we introduce the PL homotopy method of Eaves & Saigal [16]. The recently established class of variable dimension al...
متن کامل